Comparative Study of Arithmetic and Huffman Data Compression Techniques for Koblitz Curve Cryptography

Over the past 20 years, numerous papers have been written on various aspects of ECC implementation. In this paper we investigate the superiority of the Arithmetic data compression technique over the Huffman data compression technique in reducing the channel bandwidth and the transmission time. The main purpose of data compression is to reduce the memory space or transmission time, while that of cryptography is to ensure the security of the data. Applying Data compression techniques not only reduces the bandwidth but also enhances the strength of the cryptosystem. It is also observed that even if the given string is doubled i.e. AAAA (4A’s) to AAAAAAAA (8A’s), the compression ratio remains constant. Further in Arithmetic Data Compression the compression ratio is 50% more when compared to the Huffman Data Compression and the ratio increases with increasing string length. General Terms Your general terms must be any term which can be used for general classification of the submitted material such as Pattern Recognition, Security, Algorithms et. al.